# 商业转载请联系作者获得授权，非商业转载请注明出处。
# For commercial use, please contact the author for authorization. For non-commercial use, please indicate the source.
# 协议(License)：署名-非商业性使用-相同方式共享 4.0 国际 (CC BY-NC-SA 4.0)
# 作者(Author)：
# 链接(URL)：http://www.ryuichi.tech/85.html
# 来源(Source)：

#include<bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define debug  freopen("in.txt","r",stdin),freopen("out.txt","w",stdout);
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1e6+10;
using namespace std;
 
int T,N;
int a[maxn];
deque<int> q;
int pop(int sz,int p){
	int ans = 0;
	if(p == 0){
		while(q.size() && ans <= sz){
			ans += q.front();
			q.pop_front();
		}
	}else{
		while(q.size() && ans <= sz){
			ans += q.back();
			q.pop_back();
		}
	}
	return ans;
}
 
void solve(){	
	int cnt = 0;
	int ansl = 0,ansr = 0,curl = 0,curr = 0;
	while(q.size()){
		if(q.size()) curl = pop(curr,0),ansl += curl,cnt++;
		if(q.size()) curr = pop(curl,1),ansr += curr,cnt++;
	}
	cout<<cnt<<" "<<ansl<<" "<<ansr<<'\n';
}
 
int main(){
	// debug;
	ios;
	cin>>T;
	while(T--){
		cin>>N;
		for(int i = 1;i<=N;i++){
			int tmp;cin>>tmp;
			q.push_back(tmp);
		}
		solve();
	}
	
	return 0;
}
